On Parallelization of Static Scheduling Algorithms
نویسندگان
چکیده
| Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. This paper discusses the essential issues of par-allelization of static scheduling and presents two eecient parallel scheduling algorithms. The proposed algorithms have been implemented on an Intel Paragon machine, and their performance has been evaluated. These algorithms produce high-quality scheduling and are much faster than existing sequential and parallel algorithms.
منابع مشابه
An Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملA Path-Driven Loop Scheduling Mapped onto Generalized Hypercubes
One of the important issues in automatic code parallelization is the scheduling and mapping of nested loop iterations to different processors. The optimal scheduling problem is known to be NP-complete. Many heuristic static and dynamic loop scheduling techniques have been studied in the past. Here we propose a new static loop scheduling heuristic method called path-driven scheduling, under the ...
متن کاملExperimental Evaluation of A ne Schedules for Matrix Multiplication on the MasPar Architecture
This paper reports an experimental study on the suitability of systolic algorithms scheduling methods to the automatic parallelization of algorithms on SIMD computers. We consider the matrix multiplication on the MasPar MP-1 architecture. We comparatively study diierent scheduling methods and the blocking of the best resulting algorithms.
متن کاملA Graphical Tool for Automatic Parallelization and Scheduling of Programs on Multiprocessors
In this paper, we introduce an experimental software tool called CASCH (Computer Aided SCHeduling) for automatic parallelization and scheduling of applications to parallel processors. CASCH transforms a sequential program to a parallel program through automatic task graph generation, scheduling, mapping, communication, and synchronization primitives insertion. The major strength of CASCH is its...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Software Eng.
دوره 23 شماره
صفحات -
تاریخ انتشار 1997